Foldings and meanders
نویسنده
چکیده
We review the stamp folding problem, the number of ways to fold a strip of n stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to characterize and enumerate folding and meander shapes. We describe symmetric foldings and meanders, and we give formulas relating folding and meander sequences. We then use these relations to compute extended tables for these sequences.
منابع مشابه
Meanders and Stamp Foldings: Fast Generation Algorithms
By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure that will allow us to extend the order of a given meander, semi-meander, or stamp folding in constant time. Then using this data structure, we develop a constant amortized time algorithm to generate all semi-meanders of order n. By maintaining the wind-factor for semi-me...
متن کاملStamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms
By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.
متن کاملMeander , Folding and Arch Statistics
The statistics of meander and related problems are studied as particular realizations of compact polymer chain foldings. This paper presents a general discussion of these topics, with a particular emphasis on three points: (i) the use of a direct recursive relation for building (semi) meanders (ii) the equivalence with a random matrix model (iii) the exact solution of simpler related problems, ...
متن کاملCritical exponents of plane meanders
Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, n. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We use a recently developed algorithm, based on transfer matrix methods, to enumerate plane meanders. This allows us to calculate the number of closed meander...
متن کاملEnumerations of plane meanders
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is eas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 58 شماره
صفحات -
تاریخ انتشار 2014